Transition path sampling: throwing ropes over rough mountain passes, in the dark.
نویسندگان
چکیده
This article reviews the concepts and methods of transition path sampling. These methods allow computational studies of rare events without requiring prior knowledge of mechanisms, reaction coordinates, and transition states. Based upon a statistical mechanics of trajectory space, they provide a perspective with which time dependent phenomena, even for systems driven far from equilibrium, can be examined with the same types of importance sampling tools that in the past have been applied so successfully to static equilibrium properties.
منابع مشابه
Transition path sampling: throwing ropes over mountains in the dark
Understanding rare transitions occurring in complex systems, for instance chemical reactions in solution, poses the problem of finding and analysing the trajectories that move from one basin of attraction to another on a complicated potential energy surface. We have developed a systematic approach for finding these trajectories using computer simulations without preconceived knowledge of transi...
متن کاملFast mixing hyperdynamic sampling
Sequential random sampling (‘Markov Chain Monte-Carlo’) is a popular strategy for many vision problems involving multimodal distributions over high-dimensional parameter spaces. It applies both to importance sampling (where one wants to sample points according to their ‘importance’ for some calculation, but otherwise fairly) and to global optimization (where one wants to find good minima, or at...
متن کاملHyperdynamic Sampling1
Sequential random sampling (‘Markov Chain Monte-Carlo’) is a popular strategy for many vision problems involving multimodal distributions over high-dimensional parameter spaces. It applies both to importance sampling (where one wants to sample points according to their ‘importance’ for some calculation, but otherwise fairly) and to global optimization (where one wants to find good minima, or at...
متن کاملHyperdynamics Importance Sampling
Sequential random sampling (‘Markov Chain Monte-Carlo’) is a popular strategy for many vision problems involving multimodal distributions over high-dimensional parameter spaces. It applies both to importance sampling (where one wants to sample points according to their ‘importance’ for some calculation, but otherwise fairly) and to global optimization (where one wants to find good minima, or at...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Annual review of physical chemistry
دوره 53 شماره
صفحات -
تاریخ انتشار 2002